منابع مشابه
Maximum agreement and compatible supertrees
Given a collection of trees on leaves with identical leaf set, the MAST, resp. MCT, problem consists in finding a largest subset of the leaves such that all input trees restricted to this set are identical, resp. have a common refinement. For MAST, resp. MCT, on rooted trees, we give an algorithm, where and is the smallest number of leaves whose removal leads to the existence of an agreement su...
متن کاملComputing Rooted and Unrooted Maximum Consistent Supertrees
A chief problem in phylogenetics and database theory is the computation of a maximum consistent tree from a set of rooted or unrooted trees. A standard input are triplets, rooted binary trees on three leaves, or quartets, unrooted binary trees on four leaves. We give exact algorithms constructing rooted and unrooted maximum consistent supertrees in time O(2nm log m) for a set of m triplets (qua...
متن کاملConstructing rooted supertrees using distances.
Suppose that a family of rooted phylogenetic trees Ti with different sets Xi of leaves is given. A supertree for the family is a single rooted tree T whose leaf set is the union of all the Xi, such that the branching information in T corresponds to the branching information in all the trees Ti. This paper proposes a polynomial-time method BUILD-WITH-DISTANCES that makes essential use of distanc...
متن کاملOptimal Agreement Supertrees
An agreement supertree of a collection of unrooted phylogenetic trees {T1, T2, . . . , Tk} with leaf sets L(T1), L(T2), . . . ,L(Tk) is an unrooted tree T with leaf set L(T1) ∪ · · · ∪ L(Tk) such that each tree Ti is an induced subtree of T . In some cases, there may be no possible agreement supertrees of a set of trees, in other cases there may be exponentially many. We present polynomial time...
متن کاملMaximum likelihood supertrees.
We analyze a maximum likelihood approach for combining phylogenetic trees into a larger "supertree." This is based on a simple exponential model of phylogenetic error, which ensures that ML supertrees have a simple combinatorial description (as a median tree, minimizing a weighted sum of distances to the input trees). We show that this approach to ML supertree reconstruction is statistically co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2005
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-004-1147-5